Sieve in Discrete Groups, Especially Sparse
نویسنده
چکیده
We survey the recent applications and developments of sieve methods related to discrete groups, especially in the case of infinite index subgroups of arithmetic groups.
منابع مشابه
Accelerating Iterative SpMV for Discrete Logarithm Problem using GPUs
In the context of cryptanalysis, computing discrete logarithms in large cyclic groups using index-calculus-based methods, such as the number field sieve or the function field sieve, requires solving large sparse systems of linear equations modulo the group order. Most of the fast algorithms used to solve such systems — e.g., the conjugate gradient or the Lanczos and Wiedemann algorithms — itera...
متن کاملThe Special Number Field Sieve in 𝔽pn - Application to Pairing-Friendly Constructions
In this paper, we study the discrete logarithm problem in finite fields related to pairing-based curves. We start with a precise analysis of the state-of-the-art algorithms for computing discrete logarithms that are suitable for finite fields related to pairing-friendly constructions. To improve upon these algorithms, we extend the Special Number Field Sieve to compute discrete logarithms in Fp...
متن کاملThe filtering step of discrete logarithm and integer factorization algorithms
The security of most current public-key cryptosystems is based on the difficulty of finding discrete logarithms in large finite fields or factoring large integers. Most discrete logarithm and integer factoring algorithms, such as the Number Field Sieve (NFS) or the Function Field Sieve (FFS), can be described in 3 main steps: data collection, filtering and linear algebra. The goal of the filter...
متن کاملOn the Reduction of Composed Relations from the Number Eld Sieve (extended Abstract)
In this paper we will present an algorithm which reduces the weight (the number of non zero elements) of the matrices that arise from the number eld sieve (NFS) for factoring integers 9] and computing discrete logarithm in IF p , where p is a prime ((3], 13]). In the so called Quadruple Large Prime Variation of NFS a graph algorithm computes sets of partial relations (relations with up to 4 lar...
متن کاملEfficient Optimal Ate Pairing at 128-bit Security Level
Following the emergence of Kim and Barbulescu’s new number field sieve (exTNFS) algorithm at CRYPTO’16 [21] for solving discrete logarithm problem (DLP) over the finite field; pairing-based cryptography researchers are intrigued to find new parameters that confirm standard security levels against exTNFS. Recently, Barbulescu and Duquesne have suggested new parameters [3] for well-studied pairin...
متن کامل